Binary and Ternary Codes of Hadamard Matrices∗
نویسنده
چکیده
Let H be a Hadamard matrix of order 24. In this note, we show that the extremality of the binary code of H is equivalent to the extremality of the ternary code of HT . This fact has been observed by Assmus and Key [1], as a result of the complete classification of Hadamard matrices of order 24. Our proof is a consequence of more general results on the minimum weight of the dual code of the code of a Hadamard matrix, and does not depend on the classification of Hadamard matrices of order 24.
منابع مشابه
New extremal ternary self-dual codes
Compared to binary self-dual codes, few methods are known to construct ternary self-dual codes. In this paper, a construction method for ternary self-dual codes is presented. Using this method, a number of new extremal ternary self-dual codes are obtained from weighing matrices. In addition, a classification is given for extremal ternary self-dual codes of length 40 constructed from Hadamard ma...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملOn ternary self-dual codes of length 24
A hstract-A partial classification is given of the self-dual codes of length 24 over GF(3). The main results are as follows: there are exactly two codes with minimum Hamming distance d = 9; most of the codes have d = 6 and are indecomposable; one code with d = 6 has a trivial automor-phism group (this is the first such self-dual code that has been found); the codes generated by the 59 inequival...
متن کاملNew Bounds for Binary and Ternary Overloaded CDMA
In this paper, we study binary and ternary matrices that are used for CDMA applications that are injective on binary or ternary user vectors. In other words, in the absence of additive noise, the interference of overloaded CDMA can be removed completely. Some new algorithms are proposed for constructing such matrices. Also, using an information theoretic approach, we conjecture the extent to wh...
متن کاملHadamard matrices of order 32 and extremal ternary self-dual codes
As described in [7], self-dual codes are an important class of linear codes for both theoretical and practical reasons. It is a fundamental problem to classify self-dual codes of modest length and determine the largest minimum weight among self-dual codes of that length (see [7]). By the Gleason–Pierce theorem, there are nontrivial divisible self-dual codes over Fq for q = 2, 3 and 4 only, wher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007